The Theorem of the Complement for Nested Sub-pfaffian Sets

نویسندگان

  • J. - M. LION
  • P. SPEISSEGGER
چکیده

Let R be an o-minimal expansion of the real field, and let Lnest(R) be the language consisting of all nested Rolle leaves over R. We call a set nested sub-pfaffian over R if it is the projection of a boolean combination of definable sets and nested Rolle leaves over R. Assuming that R admits analytic cell decomposition, we prove that the complement of a nested sub-pfaffian set over R is again a nested sub-pfaffian set over R. As a corollary, we obtain that if R admits analytic cell decomposition, then the pfaffian closure P(R) of R is obtained by adding to R all nested Rolle leaves over R, a one-stage process, and that P(R) is model complete in the language Lnest(R).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Theorem of the Complement for Sub-pfaffian Sets

Let R be an o-minimal expansion of the real field, and let P(R) be its Pfaffian closure. Let L be the language consisting of all Rolle leaves added to R to obtain P(R). We prove that P(R) is model complete in the language L, provided that R admits analytic cell decomposition. We do this by proving a somewhat stronger statement, the theorem of the complement for nested sub-Pfaffian sets over R. ...

متن کامل

Complexity of Computations with Pfaffian and Noetherian Functions

This paper is a survey of the upper bounds on the complexity of basic algebraic and geometric operations with Pfaffian and Noetherian functions, and with sets definable by these functions. Among other results, we consider bounds on Betti numbers of sub-Pfaffian sets, multiplicities of Pfaffian intersections, effective Lojasiewicz inequality for Pfaffian functions, computing frontier and closure...

متن کامل

Complexity of Cylindrical Decompositions of Sub-pfaffian Sets

We construct an algorithm for a cylindrical cell decomposition of a closed cube In ⊂ Rn compatible with a “restricted” sub-Pfaffian subset Y ⊂ In, provided an oracle deciding consistency of a system of Pfaffian equations and inequalities is given. In particular, the algorithm produces the complement Ỹ = In \Y . The complexity bound of the algorithm, the number and formats of cells are doubly ex...

متن کامل

An effective version of Wilkie's theorem of the complement and some effective o-minimality results

Wilkie (1999) proved a “theorem of the complement” which implies that in order to establish the o-minimality of an expansion of R with C∞ functions it suffices to obtain uniform (in the parameters) bounds on the number of connected components of quantifier free definable sets. He deduced that any expansion of R with a family of Pfaffian functions is o-minimal. We prove an effective version of W...

متن کامل

Strong convergence theorem for a class of multiple-sets split variational inequality problems in Hilbert spaces

In this paper, we introduce a new iterative algorithm for approximating a common solution of certain class of multiple-sets split variational inequality problems. The sequence of the proposed iterative algorithm is proved to converge strongly in Hilbert spaces. As application, we obtain some strong convergence results for some classes of multiple-sets split convex minimization problems.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009